Pareto efficient combinatorial auctions: Dichotomous preferences without quasilinearity
نویسندگان
چکیده
We consider a combinatorial auction model where preferences of agents over bundles objects and payments need not be quasilinear. However, we restrict the to dichotomous. An agent with dichotomous preference partitions set as acceptable unacceptable, at same payment level, she is indifferent between in each class but strictly prefers unacceptable bundles. show that there no Pareto efficient, dominant strategy incentive compatible (DSIC), individually rational (IR) mechanism satisfying subsidy if domain includes all preferences. generalization VCG DSIC, IR satisfies contains only positive income effect tightness this result: adding any non-dichotomous (satisfying some natural properties) quasilinear brings back impossibility result.
منابع مشابه
Pareto Optimal Budgeted Combinatorial Auctions
This paper studies the possibility of implementing Pareto optimal outcomes in the combinatorial auction setting where bidders may have budget constraints. I show that when the setting involves a single good, or multiple goods but with single-minded bidders, there is a unique mechanism, called truncation VCG, that is individually rational, incentive compatible and Pareto optimal. Truncation VCG ...
متن کاملAssignment Preferences and Combinatorial Auctions
The bipartite matching problem and the closely related assignment problem form a cornerstone of the Networks literature. In this paper we consider the problem of a firm whose valuation function for bundles of goods is determined by an optimal assignment of goods among several agents (or tasks,) each with independent valuations for each good. Though this model of preferences may be useful on its...
متن کاملEfficient Iterative Combinatorial Auctions
This survey considers the following setting. A seller wants to sell a set of indivisible goods. A set of buyers are interested in buying the goods. Buyers have private values for bundles of goods they are interested in buying. The seller’s objective is to allocate the goods to the buyers efficiently (maximizing the total utility of buyers). Since the values of buyers are private information, th...
متن کاملMechanism Design without Quasilinearity
This paper studies a model of mechanism design when agents’ preferences over transfers need not be quasilinear. In a general model of non-quasilinearity, we characterize dominant strategy incentive compatible mechanisms using a monotonicity property. We also establish a revenue uniqueness result: for every dominant strategy implementable allocation rule, there is a unique payment rule that can ...
متن کاملStructure in Dichotomous Preferences
Many hard computational social choice problems are known to become tractable when voters’ preferences belong to a restricted domain, such as those of singlepeaked or single-crossing preferences. However, to date, all algorithmic results of this type have been obtained for the setting where each voter’s preference list is a total order of candidates. The goal of this paper is to extend this line...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Economic Theory
سال: 2021
ISSN: ['1095-7235', '0022-0531']
DOI: https://doi.org/10.1016/j.jet.2020.105128